On the variance of random polygons
نویسندگان
چکیده
A random polygon is the convex hull of uniformly distributed random points in a convex body K ⊂ R. General upper bounds are established for the variance of the area of a random polygon and also for the variance of its number of vertices. The upper bounds have the same order of magnitude as the known lower bounds on variance for these functionals. The results imply a strong law of large numbers for the area and number of vertices of random polygons for all planar convex bodies. Similar results had been known, but only in the special cases when K is a polygon or where K is a smooth convex body. The careful, technical arguments we needed may lead to tools for analogous extensions to general convex bodies in higher dimension. On the other hand one of the main results is a stronger version in dimension d = 2 of the economic cap covering theorem of Bárány and Larman. It is crucial to our proof, but it does not extend to higher dimension.
منابع مشابه
On the mean and variance of the writhe of random polygons.
We here address two problems concerning the writhe of random polygons. First, we study the behavior of the mean writhe as a function length. Second, we study the variance of the writhe. Suppose that we are dealing with a set of random polygons with the same length and knot type, which could be the model of some circular DNA with the same topological property. In general, a simple way of detecti...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملThree Heuristic Algorithms for Generation of Random
and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of random vertices using
متن کاملEstimation of Variance Components for Body Weight of Moghani Sheep Using B-Spline Random Regression Models
The aim of the present study was the estimation of (co) variance components and genetic parameters for body weight of Moghani sheep, using random regression models based on B-Splines functions. The data set included 9165 body weight records from 60 to 360 days of age from 2811 Moghani sheep, collected between 1994 to 2013 from Jafar-Abad Animal Research and Breeding Institute, Ardabil province,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2010